Modeling of Compensation in Long-Running Transactions
نویسندگان
چکیده
منابع مشابه
Modeling of Compensation in Long-Running Transactions
nowadays, the most controversial issue is transaction in database systems or web services. Specifically, in the area of service-oriented computing, where business transactions always need long periods of time to finish. In the case of a failure rollback, which is the traditional method, it will not be enough and not suitable for handling errors during long running transactions. As a substitute,...
متن کاملRefactoring Long Running Transactions
Sagas calculi have been proposed to specify distributed Long Running Transactions (LRT) and, in previous work, a subset of naive sagas has been encoded in the Signal Calculus (SC) to enable their use in service-oriented systems. Here, we promote a formal approach to the refactoring of LRT represented in SC so that distributed LRT designed in the Business Process Modelling Notation (BPMN) can be...
متن کاملModeling Long-Running Transactions with Communicating Hierarchical Timed Automata
Long-running transactions consist of tasks which may be executed sequentially and in parallel, may contain sub-tasks, and may require to be completed before a deadline. These transactions are not atomic and, in case of executions which cannot be completed, a compensation mechanism must be provided. In this paper we develop a model of Hierarchical Timed Automata suitable to describe the aspects ...
متن کاملCompositional Nested Long Running Transactions
Web Services offer a widespread standard for making services available on the Internet. Of particular interest is the possibility of composing existing distributed services to create new complex ones. Existing research has already studied long running transactions within a formal context. In this other research, compensations are just partly compositional: a transaction’s failure triggers the c...
متن کاملDynamic Recovering of Long Running Transactions
Most business applications rely on the notion of long running transaction as a fundamental building block. This paper presents a calculus for modelling long running transactions within the framework of the π-calculus, with support for compensation as a recovery mechanism. The underlying model of this calculus is the asynchronous polyadic π-calculus, with transaction scopes and dynamic installat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2016
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2016.070122